On maximal cliques of Cayley graphs over fields
نویسندگان
چکیده
We describe a new class of maximal cliques, with vector space structure, Cayley graphs defined on the additive group field. In particular, we show that in cubic Paley graph order $q^3$, subfield $q$ elements forms clique. Similar statements also hold for quadruple and Peisert quartic order.
منابع مشابه
Algebraic Cayley graphs over finite fields
Article history: Received 6 April 2013 Received in revised form 23 January 2014 Accepted 25 January 2014 Available online xxxx Communicated by Igor Shparlinski MSC: 11L40 05C75 05C50
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملFinding All Maximal Cliques in Dynamic Graphs
Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like Gt = (V,Et), where Et−1 ⊂ Et, t = 1, . . . , T ;E0 = φ. In thi...
متن کاملOn graphs whose maximal cliques and stable sets intersect
We say that a graph G has the CIS-property and call it a CIS-graph if every maximal clique and every maximal stable set of G intersect. By definition, G is a CIS-graph if and only if the complementary graph G is a CISgraph. Let us substitute a vertex v of a graph G′ by a graph G′′ and denote the obtained graph by G. It is also easy to see that G is a CIS-graph if and only if both G′ and G′′ are...
متن کاملOn Effectively Finding Maximal Quasi-cliques in Graphs
The problem of finding a maximum clique in a graph is prototypical for many clustering and similarity problems; however, in many real-world scenarios, the classical problem of finding a complete subgraph needs to be relaxed to finding an almost complete subgraph, a so-called quasi-clique. In this work, we demonstrate how two previously existing definitions of quasi-cliques can be unified and ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2022
ISSN: ['0925-9899', '1572-9192']
DOI: https://doi.org/10.1007/s10801-021-01113-y